Probabilistic operational planning using dynamic programming with time-domain simulations

نویسندگان

چکیده

A dynamic programming model with time-domain simulations of contingencies is created to find the least-costly operational strategies according a probabilistic criterion selected preventive and corrective actions. The results show that can identify which appear be satisfactory static analysis, but where system response in violating systems requirements. calculates costs related many possible operating compared models only search parts solution space. This useful for TSOs want use decision support. However, computational times are very limiting due simulations. Consequently, approaches number scenarios or speeding up should investigated. • cost elements power operation evaluated. approach used optimal strategies. finds near-optimal solutions TSOs. Time-domain gives more realistic estimate costs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Planning by Probabilistic Programming

Automated planning is a major topic of research in artificial intelligence, and enjoys a long and distinguished history. The classical paradigm assumes a distinguished initial state, comprised of a set of facts, and is defined over a set of actions which change that state in one way or another. Planning in many real-world settings, however, is much more involved: an agent’s knowledge is almost ...

متن کامل

Probabilistic Joint State Estimation for Operational Planning

Due to a high penetration of renewable energy, power systems operational planning today needs to capture unprecedented uncertainties in a short period. Fast probabilistic state estimation (SE), which creates probabilistic load flow estimates, represents one such planning tool. This paper describes a graphical model for probabilistic SE modeling that captures both the uncertainties and the power...

متن کامل

Patient admission planning using Approximate Dynamic Programming

Tactical planning in hospitals involves elective patient admission planning and the allocation of hospital resource capacities. We propose a method to develop a tactical resource allocation and patient admission plan that takes stochastic elements into consideration, thereby providing robust plans. Our method is developed in an Approximate Dynamic Programming (ADP) framework and copes with mult...

متن کامل

Probabilistic Differential Dynamic Programming

We present a data-driven, probabilistic trajectory optimization framework for systems with unknown dynamics, called Probabilistic Differential Dynamic Programming (PDDP). PDDP takes into account uncertainty explicitly for dynamics models using Gaussian processes (GPs). Based on the second-order local approximation of the value function, PDDP performs Dynamic Programming around a nominal traject...

متن کامل

Probabilistic Programming for Planning Problems

Probabilistic programing is an emerging field at the intersection of statistical learning and programming languages. An appealing property of probabilistic programming languages (PPL) is their support for constructing arbitrary probability distributions. This allows one to model many different domains and solve a variety of problems. We show the link between probabilistic planning and PPLs by i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electric Power Systems Research

سال: 2022

ISSN: ['1873-2046', '0378-7796']

DOI: https://doi.org/10.1016/j.epsr.2022.108379